Parallel acceleration of CPU and GPU range queries over large data sets
نویسندگان
چکیده
منابع مشابه
Declustering Large Multidimensional Data Sets for Range Queries over Heterogeneous Disks
Declustering is a technique to distribute data sets over multiple disks so that future retrievals can be well balanced over the disks and be performed in parallel. Although disk heterogeneity often exists in systems like clusters, most work on declustering has focused only on homogeneous environments. In this work, we investigate the declustering problem for a heterogeneous disk environment usi...
متن کاملUnleashing CPU-GPU Acceleration for Control Theory Applications
In this paper we review the effect of two high-performance techniques for the solution of matrix equations arising in control theory applications on CPU-GPU platforms, in particular advanced optimization via look-ahead and iterative refinement. Our experimental evaluation on the last GPU-generation from NVIDIA, “Kepler”, shows the slight advantage of matrix inversion via Gauss-Jordan eliminatio...
متن کاملRange Queries over DHTs
Distributed Hash Tables (DHTs) are scalable peer-to-peer systems that support exact match lookups. This paper describes the construction and use of a Prefix Hash Tree (PHT) – a distributed data structure that supports range queries over DHTs. PHTs use the hash-table interface of DHTs to construct a search tree that is efficient (insertions/lookups take DHT lookups, where D is the data domain be...
متن کاملParallel 3D Image Segmentation of Large Data Sets on a GPU Cluster
In this paper, we propose an inherent parallel scheme for 3D image segmentation of large volume data on a GPU cluster. This method originates from an extended Lattice Boltzmann Model (LBM), and provides a new numerical solution for solving the level set equation. As a local, explicit and parallel scheme, our method lends itself to several favorable features: (1) Very easy to implement with the ...
متن کاملParallel and Improved PageRank Algorithm for GPU-CPU Collaborative Environment
The internet is a huge collection of websites in the order of 10 bytes. Around 90% of the world’s population uses search engines for getting relevant information. According to Wikipedia, more than 200 million Indians use the Internet every day. Thus the correct data retrieval least time domain is the most important task. Hence need of efficient and parallel PageRanking algorithm. All the existi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cloud Computing
سال: 2020
ISSN: 2192-113X
DOI: 10.1186/s13677-020-00191-w